Deterministic Grover search with a restricted oracle

Grover's quantum search algorithm provides a quadratic advantage over classical algorithms across broad class of unstructured problems. The original protocol is probabilistic, returning the desired result with significant probability on each query but, in general, requiring several iterations algorithm. We present modified version to return correct certainty without having user control oracle. Our deterministic, two-parameter “D2p” utilizes generalized phase rotations replacing inversions after standard oracle query. D2p achieves 100% success rate no more than one additional iteration compared optimal number steps as enabling same speedup. also provide visualization using Bloch sphere for enhanced geometric intuition.Received 12 January 2022Accepted 21 March 2022DOI:https://doi.org/10.1103/PhysRevResearch.4.L022013Published by American Physical Society under terms Creative Commons Attribution 4.0 International license. Further distribution this work must maintain attribution author(s) and published article's title, journal citation, DOI.Published SocietyPhysics Subject Headings (PhySH)Research AreasQuantum algorithmsQuantum protocolsQuantum Information